6 found
Order:
  1.  56
    Notions of weak genericity.Stuart A. Kurtz - 1983 - Journal of Symbolic Logic 48 (3):764-770.
  2.  27
    Recursion theory and ordered groups.R. G. Downey & Stuart A. Kurtz - 1986 - Annals of Pure and Applied Logic 32:137-151.
  3.  17
    Computational Limitations of Small-Depth Circuits.Stuart A. Kurtz & Johan Hastad - 1988 - Journal of Symbolic Logic 53 (4):1259.
  4.  45
    A Computer Scientist's Perspective on Chaos and Mystery.Stuart A. Kurtz - 2002 - Zygon 37 (2):415-420.
    James E. Huchingson's Pandemonium Tremendum draws on a surprisingly fruitful analogy between metaphysics and thermodynamics, with the latter motivated through the more accessible language of communication theory. In Huchingson's model, God nurtures creation by the selective communication of bits of order that arise spontaneously in chaos.
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  5.  41
    Every polynomial-time 1-degree collapses if and only if P = PSPACE.Stephen A. Fenner, Stuart A. Kurtz & James S. Royer - 2004 - Journal of Symbolic Logic 69 (3):713-741.
    A set A is m-reducible to B if and only if there is a polynomial-time computable function f such that, for all x, x∈ A if and only if f ∈ B. Two sets are: 1-equivalent if and only if each is m-reducible to the other by one-one reductions; p-invertible equivalent if and only if each is m-reducible to the other by one-one, polynomial-time invertible reductions; and p-isomorphic if and only if there is an m-reduction from one set to the (...)
    Direct download (11 more)  
     
    Export citation  
     
    Bookmark  
  6.  23
    Håstad Johan. Computational limitations of small-depth circuits. ACM doctoral dissertation awards. The MIT Press, Cambridge, Mass., and London, 1987, xiii + 84 pp. [REVIEW]Stuart A. Kurtz - 1988 - Journal of Symbolic Logic 53 (4):1259-1260.
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark